Correct Transformation of Rewrite Systems for Implementation Purposes
نویسندگان
چکیده
We propose the notion of a correct transformation of one rewrite system into another If such a transformation is correct then the normal forms of a term in the original rewrite system can be obtained by computing the normal forms of the interpretation of this term in the transformed rewrite system We show for several transformations from the literature that they are correct most notably for the notion of simulation from Kamperman and Walters
منابع مشابه
Applications of the TAMPR Transformation System
In this paper we present an overview of the uses of the TAMPR transformation system and present experience with using transformation in industrial applications. TAMPR is a fully automatic, rewrite-rule based program transformation system. From its initial implementation in 1970, TAMPR has evolved into a powerful tool for generating correct and efficient programs from specifications. The specifi...
متن کاملA Survey of Rewriting Strategies in Program Transformation Systems∗
Program transformation is used in a wide range of applications including compiler construction, optimization, program synthesis, refactoring, software renovation, and reverse engineering. In the realization of a program transformation system for a certain type of transformation, design choices must be made regarding the representation of programs and the paradigm for implementation of transform...
متن کاملSimulation as a Correct Transformation of Rewrite Systems
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct...
متن کاملProving termination of CHR in Prolog: A transformational approach
In this paper we present a termination preserving transformation from Constraint Handling Rules to Prolog. The transformation is sound w.r.t. termination under the theoretical semantics of Constraint Handling Rules. It does not consider the presence of a propagation history. The transformation allows for the direct reuse of termination proof methods from Logic Programs and Term-Rewrite Systems,...
متن کاملRascal Tooling for Datatype Defining Rewrite Systems
It has been argued in [7] that using automated provers such as AProVE [4] and CSI [3] can benefit research projects on the topic of datatype defining rewrite systems (DDRSs), as the size of these DDRSs make manual completeness proofs long and error-prone. The authors of [7] note that no similar software exists for the ground-confluence property, and in [1] it is argued that such software should...
متن کامل